Fritz: All Fritz/All Fritz.zip/All Fritz/FILES/DATATION/TOM.LZH/TOM102.EXE/README.TXT

Text File | 1992-02-20 | 12KB | 362 lines

                             T  O  M  (TM)
                       -------------------------

                             Version 1.02
                            --------------

                         R E A D M E   F I L E
                   --------------------------------


                      Last updated:  February, 1992



   This file contains some information that weren't available when the manual
was being printed and changes implemented in version 1.02 of TOM.

    The documentation of TOM (TOM.DOC) refers to some figures on some pages.
Please ignore them. Only the printed manual includes those figures. Also,
TOM.DOC only contains a page break at the beginning of each chapter. No page
numbers were included to make it easier to print on different types of
printers and paper formats.

You can format TOM.DOC with any editor/word processor of your choice.


   This document discusses the following points:

        0- about the author, ASP and the ASP Ombudsman
        1- changes to the search algorithm in version 1.02
        2- wild card search implemented in version 1.02
        3- quick jump added to version 1.02
        4- updated list of the boring words for version 1.02
        5- using TOM(tm) on a network
        6- ordering information and technical support
        7- corrections to the printed manual
    8- the screen captures in the documentation
        9- acknowledgments



0- About the author, ASP and the ASP Ombudsman
   -------------------------------------------

   This program is produced by George Tohme, member of the Association of
   Shareware Professionals (ASP). ASP wants to make sure that the shareware
   principle works for you. If you are unable to resolve a shareware-related
   problem with an ASP member by contacting the member directly, ASP may be
   able to help. The ASP Ombudsman can help you resolve a dispute or problem
   with an ASP member, but does not provide technical support for members'
   products. Please write to the ASP Ombudsman at 545 Grover Road, Muskegon,
   MI 49442 or send a CompuServe message via CompuServe Mail to ASP Ombudsman
   70007,3536.


1- The Search Algorithm of version 1.02
   ------------------------------------

   The manual of version 1.00 lists the single digits numbers as boring 'words'
   because few people would search for cards where a single digit number is
   located.
   Although 2, 3, ... digit numbers are indexed, (these numbers might hold a
   certain significance), single digit numbers were ignored and not indexed.

   But in certain environments, these numbers might be critical especially
   decimal numbers that can refer to all types of information such as version
   numbers for software or drivers....
   For that reason, in version 1.02, single digit numbers have been removed
   from the boring words list and are included in the index.

   Still, decimal numbers are not indexed as a whole. In other words, if a
   decimal is encountered during indexing the indexing engine will treat the
   number as two seperate entities, the integer part and the decimal part.
   For example, if the number 123.456 is in a card it will be treated as two
   numbers: 123 and 456 and indexed seperatly.

   To search for a decimal number you simply surround it with double quotes.
   So if you are searching for the above number and the word 'Bart' the
   search condition would be:
     bart and "123.456"

   The same technique applies if you want to search for any text that might
   include characters like: ' - / _ . $ @ # etc....
   simply include the string within quotation marks.

   One drawback to the above is that searching for decimal numbers or strings
   of characters that contain some seperators might take longer to complete.
   This will be corrected in the next release of TOM(tm).


2- Wild card
   ---------

   Version 1.02 allows you to include an asterix (*) at the end of the words
   that you include in a search condition.
   For example you can have a search condition like this:
     Network* and (card or adapter)
   The above condition allows you to find all words that start with 'network'
   i.e networking, networks...

   There in no limitation as to where in the search condition you can use
   words with wild card.

   Keep in mind that only one wild card allowed per word and only as the last
   character of it.


3- Quick Jump
   ----------

   In version 1.00, you can search for something, TOM will list the found
   cards, you can open each card and page-down or page-up until you find
   the highlighted text that you're searching for.

   In version 1.02, once you open a card you don't need to keep on hitting
   page-up/page-down to locate what you're after, you can simply hit F2 to
   jump to the first occurence, the second, and so on. F3 gives you the
   same effect but backward.


4- The Updated Boring Words List (version 1.02)
   --------------------------------------------

   A        ABOUT        ABOVE
   AFTER    AGAIN        AGREE
   AGREES    AGREED            ALL
   ALMOST    ALONG        ALSO
   ALTHOUGH    ALWAYS            AN
   AND        ANOTHER            ANY
   ARE        AREN'T        AROUND
   AS        ASK        ASKED
   ASKING    ASKS        AT

   B        BACK        BE
   BECAUSE    BEEN        BEFORE
   BEGAN    BEING        BELOW
   BETWEEN    BIG        BOTH
   BUT        BY

   C        CALL        CALLED
   CALLING    CALLS        CAME
   CAN        CAN'T        CANNOT
   COME        COULD        COULDN'T

   D        DID        DIDN'T
   DO        DOES        DOESN'T
   DON'T    DOWN

   E        EACH        END
   ENDED    ENDING            ENDS
   ENOUGH    ETC        EVEN
   EVER        EVERY

   F        FAR        FEW
   FIND        FOLLOW            FOLLOWED
   FOLLOWING    FOLLOWS            FOR
   FOUND    FOUR        FROM
   FURTHER

   G        GAVE        GET
   GIVE        GIVEN        GO
   GOES        GOING        GOOD
   GOT

   H        HAD        HADN'T
   HAS        HASN'T        HAVE
   HE        HER        HERE
   HIM        HIMSELF            HIS
   HOW        HOWEVER

   I        IF        IN
   INTO        IS        ISN'T
   IT        ITS        ITSELF

   J        JUST

   K        KEEP        KEEPING
   KEEPS    KEPT        KIND
   KNOW        KNOWING            KNOWS

   L        LEFT        LET
   LIKE        LIKED        LIKES
   LIKING    LOOK        LOOKED
   LOOKING    LOOKS

   M        MADE        MAKE
   MAKES    MAKING            MANY
   ME        MIGHT        MORE
   MOST        MR        MRS
   MS        MUCH        MUST
   MY

   N        NAME        NAMED
   NAMES    NAMING            NEAR
   NEARED    NEARING            NEARS
   NEED        NEEDED            NEEDING
   NEEDS    NEVER        NEW
   NEXT        NO        NOT
   NOW        NUMBER            NUMBERED
   NUMBERING    NUMBERS

   O        OBSERVE            OBSERVED
   OBSERVERS    OBSERVING    OF
   OFF        OFTEN        ON
   ONCE        ONE        ONLY
   OR        OTHER        OUR
   OUT        OVER        OWN

   P        PART        PARTED
   PARTING    PARTS        PLACE
   PUT

   Q

   R        RE        READ
   RIGHT

   S        SAID        SAME
   SAY        SAYING            SAYS
   SEE        SET        SHALL
   SHE        SHOULD            SHOULDN'T
   SHOW        SIDE        SINCE
   SO        SOME        SOMETHING
   SOMETIMES    SOON        STILL
   STUDY    SUCH

   T        TAKE        TAKEN
   TAKES    TELL        TELLING
   TELLS    THAN        THAT
   THE        THEIR        THEM
   THEN        THERE        THESE
   THEY        THING        THINGS
   THINK    THINKING    THINKS
   THIS        THOSE        THOUGH
   THOUGHT    THREE        THROUGH
   TIME        TIMED        TIMES
   TIMING    TO        TOGETHER
   TOLD        TOO        TOOK
   TWO

   U        UNDER        UNTIL
   UP        US        USE
   USED        USES        USING

   V        VERY

   W        WANT        WANTED
   WANTING    WANTS        WAS
   WAY        WE        WELL
   WENT        WERE        WEREN'T
   WHAT        WHEN        WHERE
   WHICH    WHILE        WHO
   WHO'D    WHY        WILL
   WITH        WITHIN            WITHOUT
   WON'T    WORD        WORDS
   WOULD    WOULDN'T

   X

   Y        YEAR        YEARS
   YES        YOU        YOU'D
   YOU'RE    YOUR

   Z


5- Runing TOM(tm) On A Network
   ---------------------------

   Although TOM is a single user application, it can be used on a network.
   It was tested successfully on Novell NetWare file servers. This does not
   imply that the software will not run on other systems.

   One important thing should be mentioned here. If multiple users would like
   to access the same library, make sure that all the files unders the LIB
   directory and under all of its subdirectories are flaged as shareable.
   Also note that only ONE user should add/delete/modify items in the library
   at a time.

   A read-only version can be supplied by PolySoft to customers who purchased
   a site licence to run TOM on a network. The read-only version will give
   the users search and browse access without allowing them to alter the
   content of the library.

   To obtain your copy of the read-only version you MUST purchase a site
   licence of TOM.

   For Information on site licence pricing refer to the SITE.TXT file.


6- Ordering information and technical Support
   ------------------------------------------

   Please read the accompanying file (ORDER.TXT) for information on how to
   order a registered copy TOM.

   PolySoft-Australia will provide registered users with free technical
   support for three months from the registration date. Technical support can be
   obtained by:
            - Mail addressed to
                     POLYSOFT-AUSTRALIA
                     P.O. BOX K245
                     HAYMARKET
                     SYDNEY 2000
                     AUSTRALIA

            - or Email on CompuServe to user ID 76244,3171.

   The above free Technical Support we provide consists of answering questions
   and fixing any reproducible program errors/bugs that interfere with the
   intended use of the program as described in this documentation.
   PolySoft-Australia may choose not to fix problems related to a special
   hardware and/or software configuration and will then arrange for a refund
   of the registration fee, if the problem is reported within two months of
   payment. PolySoft-Australia makes no other warranties, expressed or
   implied, and this warranty is expressly limited to the cost of the
   registration fee.

   When you register you will get a serialized copy of TOM(tm). You will
   need the serial number to get technical support from PolySoft-Australia.

        THE SERIAL NUMBER IS VERY IMPORTANT. GUARD IT WITH YOUR LIFE.


7- Corrections to the printed manual
   ---------------------------------

   In version 1.00 manual, Appendix A states the the command to restore a
   line after it's been deleted is Ctrl-N.
   The correct command to restore a line is Ctrl-U.


8- Screen captures in the documentations
   -------------------------------------

   The document file included in this package contains all the figures that
   are referenced in the text. These screens do not show any hilighted text
   (of course!!) and special characters like the cursor-up or cursor-down
   symbols, that the text might mention.

   I have included these screens to provide you with a complete package and
   conform to the ASP rules.


9- Aknowledgments
   --------------

   I would like to thank the following people and companies:

   - My wife Germaine for her patience, advice and support
   - Borland International for providing the best compiler ever, Turbo C
   - Samna International for their excelent word processor, Ami that made
     creating professionaly printed manuals a breeze
   - The Association Of Shareware Professional (ASP) especially Paul Mayer,
     Nelson Ford, Barry Simon and many, many others for their advice and help
     to get TOM to you
   - CompuServe Incorporated for making it all possible
   - you for trying out TOM

   ----------------------------------------- END OF README.TXT ----------